Nondeterministic finite automaton - PDFSEARCH.IO - Document Search Engine

Nondeterministic finite automaton
Results: 144

#	Item
31	Automated Grading of DFA Constructions ∗ Rajeev Alur and Loris D’Antoni Sumit Gulwani Dileep Kini and Mahesh Viswanathan Department of Computer Science Microsoft Research Department of Computer Science Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2013-04-24 11:35:08 Applied mathematics Deterministic finite automaton DFA minimization Nondeterministic finite automaton Regular expression DFA Records Normal distribution Regular language Structure Automata theory Theoretical computer science Computer science
32	ICS 162 – Fall 2003 – Midterm Name: Solution Key Student ID: 1: 30 Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2003-11-21 17:50:43 Mathematics Computer science Pumping lemma for regular languages Deterministic finite automaton Nondeterministic finite automaton Pumping lemma for context-free languages Regular language Regular expression String Formal languages Automata theory Theoretical computer science
33	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Exact and approximate Geometric Pattern Matching for point sets in the plane under similarity transformations ∗ Dror Aiger† Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:29:05 Models of computation Quantum field theory Nondeterministic finite automaton Gδ set Automata theory Measure theory Support
34	Regularity Problems for Weak Pushdown ω-Automata and Games Extended VersionChristof L¨oding and Stefan Repke⋆ Lehrstuhl f¨ ur Informatik 7, RWTH Aachen, Germany Add to Reading List Source URL: www.automata.rwth-aachen.de Language: English - Date: 2012-09-03 08:07:06 Formal languages Computer science Deterministic pushdown automaton Ω-automaton Pushdown automaton Omega language Nondeterministic finite automaton Context-free language Regular language Automata theory Theoretical computer science Models of computation
35	A How Can Automatic Feedback Help Students Construct Automata? LORIS D’ANTONI, University of Pennsylvania DILEEP KINI, University of Illinois at Urbana-Champaign RAJEEV ALUR, University of Pennsylvania Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2015-03-11 17:28:03 Computer science Applied mathematics Deterministic finite automaton Nondeterministic finite automaton DFA Records Finite-state machine Algorithm Counterexample Regular expression Automata theory Models of computation Theoretical computer science
36	Automated Grading of DFA Constructions Rajeev Alur and Loris D’Antoni Sumit Gulwani Dileep Kini and Mahesh Viswanathan Department of Computer Science Microsoft Research Department of Computer Science Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2013-05-16 00:14:15 Model theory Models of computation Formal languages Abstraction Metalogic Deterministic finite automaton Nondeterministic finite automaton Interpretation DFA minimization Automata theory Mathematics Logic
37	ICS 162 – Fall 2003 – Midterm Name: Student ID: 1: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2003-11-10 23:13:26 Models of computation Computer science Software engineering Regular language Deterministic finite automaton Context-free grammar Nondeterministic finite automaton Regular expression Book:Theory Of Computation Automata theory Formal languages Theoretical computer science
38	Microsoft Word - ijita12-4.doc Add to Reading List Source URL: www.foibg.com Language: English - Date: 2015-02-02 08:42:05 Models of computation Nondeterministic finite automaton Vector space Muller automaton Ω-automaton Algebra Automata theory Mathematics
39	Parameterized Verification of Communicating Automata under Context Bounds Benedikt Bollig1 , Paul Gastin1 , and Jana Schubert2 1 LSV, ENS Cachan & CNRS {bollig,gastin}@lsv.ens-cachan.fr Add to Reading List Source URL: www.lsv.ens-cachan.fr Language: English - Date: 2014-09-19 10:50:53 Ω-automaton Automata theory Tree automaton Nondeterministic finite automaton
40	trx : Regular-tree expressions, now in Scheme Ilya Bagrak University of California, Berkeley Olin Shivers Add to Reading List Source URL: repository.readscheme.org Language: English - Date: 2010-10-22 08:05:32 Computer programming Tree automaton Pattern matching Regular expression Pushdown automaton Binary tree Abstract syntax tree Nondeterministic finite automaton Finite-state machine Software engineering Automata theory Computing

UPDATE